Processes with Multiple Entries and Exits Modulo Isomorphism and Modulo Bisimulation
نویسندگان
چکیده
This paper proposes a framework for the integration of the algebra of communicating processes (ACP) and the algebra of ownomials (AF). Basically, this means to combine axiomatisations of parallel and looping operators. To this end a model of process graphs with multiple entries and exits is introduced. In this model the usual operations of both algebras are de ned, e.g. alternative composition, sequential composition, feedback, parallel composition, left merge, communication merge, encapsulation, etc. The main results consist of correct and complete axiomatisations for process graphs modulo isomorphism and modulo bisimulation.
منابع مشابه
An Axiomatization for Regular Processes in Times Branching Bisimulation
Klusener introduced a timed variant of branching bisimulation. In this paper it is shown that Klusener's axioms for nite process terms, together with two standard axioms for recursion, make a complete axiomatization for regular processes modulo timed branching bisimulation.
متن کاملA Tractarian Universe
In this paper we develop a reconstruction of the Tractatus ontology. The basic idea is that objects are unsaturated and that Sachlagen are like molecules. Bisimulation is used for the proper individuation of the Sachlagen. We show that the ordering of the Sachlagen is a complete distributive, lattice. It is atomistic, i.e., each Sachlage is the supremum of the Sachverhalte below it. We exhibit ...
متن کاملHereditary properties of amenability modulo an ideal of Banach algebras
In this paper we investigate some hereditary properties of amenability modulo an ideal of Banach algebras. We show that if $(e_alpha)_alpha$ is a bounded approximate identity modulo I of a Banach algebra A and X is a neo-unital modulo I, then $(e_alpha)_alpha$ is a bounded approximate identity for X. Moreover we show that amenability modulo an ideal of a Banach algebra A can be only considered ...
متن کاملIsomorphism Checking for Symmetry Reduction
In this paper, we show how isomorphism checking can be used as an effective technique for symmetry reduction. Reduced state spaces are equivalent to the original ones under a strong notion of bisimilarity which preserves the multiplicity of outgoing transitions, and therefore also preserves stochastic temporal logics. We have implemented this in a setting where states are arbitrary graphs. Sinc...
متن کاملAlgebraic Synchronization Trees and Processes
We study algebraic synchronization trees, i.e., initial solutions of algebraic recursion schemes over the continuous categorical algebra of synchronization trees. In particular, we investigate the relative expressive power of algebraic recursion schemes over two signatures, which are based on those for Basic CCS and Basic Process Algebra, as a means for defining synchronization trees up to isom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 27 شماره
صفحات -
تاریخ انتشار 1996